The time to read the input and initialise the problem = 313 ms
The time to create the LP bound problem = 15 ms
The time to compute the linear programming bound = 79 ms
The linear programming lower bound on the solution is:
x11=0.431818
x12=0.545455
x13=0.000000
x14=0.022727
x15=0.000000
x21=0.618182
x22=0.381818
x23=0.000000
x24=0.000000
x25=0.000000
x31=0.000000
x32=0.545455
x33=0.000000
x34=0.454545
x35=0.000000
x41=1.000000
x42=0.000000
x43=0.000000
x44=0.000000
x45=0.000000
x51=0.000000
x52=0.545455
x53=0.000000
x54=0.454545
x55=0.000000
x61=0.000000
x62=0.545455
x63=0.000000
x64=0.454545
x65=0.000000
x71=0.000000
x72=0.000000
x73=0.000000
x74=1.000000
x75=0.000000
x81=0.130435
x82=0.000000
x83=0.869565
x84=0.000000
x85=0.000000
x91=0.000000
x92=0.000000
x93=1.000000
x94=0.000000
x95=0.000000
x101=0.000000
x102=0.545455
x103=0.000000
x104=0.454545
x105=0.000000
y1=1.000000
y2=0.545455
y3=1.000000
y4=1.000000
y5=0.000000
z1=0.000000
z2=0.582418
z3=0.414414
w11=0.000000
w12=0.000000
w13=0.000000
w14=0.000000
w15=0.000000
w21=0.000000
w22=0.000000
w23=53.000000
w24=0.000000
w25=0.000000
w31=54.000000
w32=72.000000
w33=0.000000
w34=58.000000
w35=0.000000
z=64995.717242
The time to read the LP bound solution = 15 ms
Run time is 1422 ms
